Modelling the hop-constrained minimum spanning tree problem over a layered graph
نویسندگان
چکیده
The Hop-constrained Minimum Spanning Tree Problem (HMST) is defined as follows: given a graph G = (V,E) with node set V = {0, 1, . . . , n} and edge set E as well as a cost ce associated with each edge e of E and a natural number H , we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has no more than H hops (edges).
منابع مشابه
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibilities to model the Hop Constrained (HC) Connected Facility Location problem (ConFL) as ConFL on layered graphs. We show that on all three layered graphs the respective LP relaxations of two cut based models are of the ...
متن کاملModeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
The Hop-Constrained Minimum Spanning Tree Problem (HMSTP) is a NP-hard problem arising in the design of centralized telecommunication networks with quality of service constraints. We show that the HMSTP is equivalent to a Steiner Tree Problem (STP) in an adequate layered graph. We prove that the directed cut formulation for the STP defined in the layered graph, dominates (in terms of the linear...
متن کاملLayered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
This article studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. Th...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملHop Constrained Connected Facility Location
The Connected Facility Location (ConFL) problem combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facili...
متن کامل